//
// Created by Jisam on 24/08/2024 7:01 PM.
// Solution of  a
#pragma GCC optimize(3)

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
#include<climits>

using namespace std;

#define endl "\n"
#define PSI pair<string,int>
#define PII pair<int,int>
#define PDI pair<double,int>
#define PDD pair<double,double>
#define VVI vector<vector<int>>
#define VI vector<int>
#define VS vector<string>

#define PQLI priority_queue<int, vector<int>, less<int>>
#define PQGI priority_queue<int, vector<int>, greater<int>>
#define code_by_jisam ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
using namespace std;
using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128;
int dx[] = {-1, 1, 0, 0, 1, 1, -1, -1,};
int dy[] = {0, 0, -1, 1, 1, -1, -1, 1,};
bool compare(int a, int b) {
    return a > b;
}
void solution() {
    int n;
    cin >> n;

    vector<int> lengths(n);
    for (int i = 0; i < n; ++i) {
        cin >> lengths[i];
    }


    // 对积木长度进行排序
    sort(lengths.begin(),  lengths.end(),  compare);

    vector<int> results(n, 0);

    // 遍历每个积木
    for (int i = 0; i < n; ++i) {
        // 找到当前积木在排序后列表中的位置
        auto it = find(lengths.begin(),  lengths.end(),  lengths[i]);
        int pos = distance(lengths.begin(),  it);
        // 计算层数
        results[i] = pos + 1;
    }
    for(auto it = results.rbegin(); it != results.rend(); it ++ ){
        cout << it.base() <<endl;
    }
}

int main() {
    code_by_jisam;
    int T = 1;
//    cin >> T;
    while (T--) {
        solution();
    }
    return 0;
}